Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
141	Disjoint T -paths in tough graphs Tom´aˇs Kaiser∗ Abstract Let G be a graph and T a set of vertices. A T -path in G is a path that begins and ends in T , and none of its internal vertices are contained Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
142	Expressive Languages for Path Queries over Graph-Structured Data Pablo Barcelo´ Carlos Hurtado Add to Reading List Source URL: users.dcc.uchile.cl Language: English - Date: 2010-03-24 12:24:09
143	Semester / Bachelor / Master Thesis Edge Flips in Combinatorial Triangulations Figure 1: Successive flips in a combinatorial triangulation: a path in the flip graph. Add to Reading List Source URL: vincentkusters.org Language: English
144	PRICING ON PATHS: A PTAS FOR THE HIGHWAY PROBLEM∗ FABRIZIO GRANDONI† AND THOMAS ROTHVOß‡ Abstract. In the highway problem, we are given an n-edge path graph (the highway), and a set of paths (the drivers), each on Add to Reading List Source URL: people.idsia.ch Language: English - Date: 2015-12-01 09:32:14
145	A Expressive Languages for Path Queries over Graph-Structured Data ´ , University of Chile PABLO BARCELO LEONID LIBKIN, University of Edinburgh ANTHONY W. LIN, Univerity of Oxford Add to Reading List Source URL: users.dcc.uchile.cl Language: English - Date: 2012-08-24 14:18:43
146	Parallel De Bruijn Graph Construction and Traversal for De Novo Genome Assembly Evangelos Georganas†,‡ , Aydın Buluc¸† , Jarrod Chapman∗ Leonid Oliker† , Daniel Rokhsar∗,¶ , Katherine Yelick†,‡ Computa Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2014-09-08 14:12:54 Bioinformatics Biology Academia Computational biology Hashing K-mer Eulerian path Bloom filter Trie Parallel computing Hash table MurmurHash
147	High-Productivity and High-Performance Analysis of Filtered Semantic Graphs Aydın Buluç1∗ , Erika Duriakova2 , Armando Fox4 , John R. Gilbert3 , Shoaib Kamil4,5∗ , Adam Lugowski3∗ , Leonid Oliker1 , Samuel Willia Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-02-06 05:00:15 Graph theory Mathematics Discrete mathematics Shortest path problem Semiring Graph Adjacency list Breadth-first search
148	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
149	Parallel Processing of Filtered Queries in Attributed Semantic Graphs I Adam Lugowskia,∗, Shoaib Kamilb,∗, Aydın Buluçc,∗, Samuel Williamsc , Erika Duriakovad , Leonid Olikerc , Armando Foxe , John R. Gilberta Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2014-09-08 14:04:49 Graph theory Mathematics Algebraic structures Ring theory Semiring Shortest path problem Breadth-first search Graph traversal Neighbourhood Graph
150	PDF Document Add to Reading List Source URL: security.cs.georgetown.edu Language: English - Date: 2014-07-11 14:03:09 Graph theory Mathematics Computational complexity theory Edsger W. Dijkstra Combinatorial optimization Network theory Maximal independent set Graph coloring Shortest path problem Matching Leader election Minimum spanning tree

UPDATE